[1] Habergeon L T, Dias G V, Levitt K Net. A network security monitor//Proceedings of the 1990 IEEE Symposium on Research in Security and Privacy. Oakland: IEEE Press, 1990: 296-304. [2] Knuth D E, Morris J H, Prattck V R. Fast pattern matching in strings[J]. SIAM Journal Computer, 1977, 6(2): 323-350. [3] Boyer R S, Moore J S. A fast string searching algorithm[J]. Comm ACM, 1977, 20(10): 762-772. [4] Sunday D M. A very fast substring search algorithm[J]. Comm ACM, 1990, 33(8): 132-142. [5] Aho A V, Corasick M J. Efficient string matching: an aid to bibliograph ic search[J]. Comm ACM, 1975, 18(6): 333-340. [6] Commentz-Walter B. A string matching algorithm fast on average//Proceeding of the 6th Int Colloq on Automata, Languages and programming. Graz:, 1979. [7] Fan Jang-jong, Su Keh-yih. An efficient algorithm for match multiple patterns[J]. IEEE Transactioins on Knowledge and Data Engineering, 1993, 5(2): 339-351. [8] 沈洲, 王永成, 许一震. 一种面向中文的快速字串多模式匹配算法[J]. 上海交通大学学报, 2001, 35(9): 1285-1289. Shen Zhou, Wang Yongcheng, Xu Yizhen. A fast multiple pattern algorithm for Chinese string matching[J]. Journal of Shanghai Jiaotong University, 2001, 35(9): 1285-1289. [9] 许一震, 王永成, 沈洲. 一种快速的多模式字符串匹配算法[J]. 上海交通大学学报, 2002, 36(4): 516-520. Xu Yizhen, Wang Yongcheng, Shen Zhou. A fast algorithm for matching multiple patterns[J]. Journal of Shanghai Jiaotong University, 2002, 36(4): 516-520. |